Pattern Matching in Compressed Raster Images
نویسندگان
چکیده
We study the problem of nding a two-dimensional pattern in a compressed satellite image. We present an algorithm that solves this problem without decompressing the image. The runtime of our algorithm is linear in the sum of the sizes of the compressed image and the pattern, unless the image contains many large parts that match the pattern partially, but not fully | an unlikely situation for satellite images. This study contributes to a better understanding of what operations can be performed directly on compressed raster images.
منابع مشابه
Pattern - Matching Problems for
The power of weighted nite automata to describe very complex images was widely studied, see [5, 6, 7]. Finite automata can be also used as an e ective tool for compression of twodimensional images. There are some software packages using this type of compression, see [12, 6]. We consider the complexity of some pattern-matching problems for two-dimensional images which are highly compressed using...
متن کاملThe Complexity of Two - DimensionalCompressed Pattern -
We consider the complexity of problems for highly compressed 2-dimensional texts: compressed pattern-matching (when the pattern is not compressed and the text is compressed) and fully compressed pattern-matching (when also the pattern is compressed). First we consider 2-dimensional compression in terms of straight-line programs, see 9]. It is a natural way for representing very highly compresse...
متن کاملCompressed Pattern Matching for Predictive Lossless Image Encoding
Pattern matching in compressed image domain is a new topic in computer science. Many works have been reported for pattern matching for compressed text and for lossy compressed image. However, searching of images in lossless compressed domain is almost a blank area and needs to be explored. Lossless image compression is widely used in areas such as medical images, satellite images, geometric ima...
متن کاملPattern Matching in Compressed Texts and Images
This review provides a survey of techniques for pattern matching in compressed text and images. Normally compressed data needs to be decompressed before it is processed, but if the compression has been done in the right way, it is often possible to search the data without having to decompress it, or at least only partially decompress it. The problem can be divided into lossless and lossy compre...
متن کاملWord Searching in CCITT Group 4 Compressed Document Images
In this paper, we present a compressed pattern matching method for searching user queried words in the CCITT Group 4 compressed document images, without decompressing. The feature pixels composed of black changing elements and white changing elements are extracted directly from the CCITT Group 4 compressed document images. The connected components are labeled based on a line-by-line strategy ac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996